Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Satisfaccion restricción")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2361

  • Page / 95
Export

Selection :

  • and

On Identifying Infeasible Subsets in Constraint Satisfaction ProblemsHU, J; GALINIER, P; CAMINADA, A et al.Artificial intelligence. International conferenceWorldComp'2010. 2010, pp 615-619, isbn 1-60132-146-5 1-60132-147-3 1-60132-148-1, 5 p.Conference Paper

Constraint programming next challenge: Simplicity of usePUGET, Jean-Francois.Lecture notes in computer science. 2004, pp 5-8, issn 0302-9743, isbn 3-540-23241-9, 4 p.Conference Paper

International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR 2005)BARTAK, Roman; MILANO, Michela.Constraints (Dordrecht). 2006, Vol 11, Num 4, issn 1383-7133, 106 p.Conference Proceedings

Special Issue on Constraint Satisfaction for Planning and Scheduling ProblemsBARTAK, Roman; SALIDO, Miguel A.Constraints (Dordrecht). 2011, Vol 16, Num 3, issn 1383-7133, 119 p.Serial Issue

Circuit consistenciesIDRISSI, Abdellah; BEN HASSINE, Ahlem.Lecture notes in computer science. 2004, pp 124-133, issn 0302-9743, isbn 3-540-22817-9, 10 p.Conference Paper

Separating search and strategy in solver cooperationsPAJOT, Brice; MONFROY, Eric.Lecture notes in computer science. 2003, pp 401-414, issn 0302-9743, isbn 3-540-20813-5, 14 p.Conference Paper

A comparative study of arithmetic constraints on integer intervalsAPT, Krzysztof R; ZOETEWEIJ, Peter.Lecture notes in computer science. 2004, pp 1-24, issn 0302-9743, isbn 3-540-21834-3, 24 p.Conference Paper

Learning approximate consistenciesLALLOUET, Arnaud; LEGTCHENKO, Andreï; DAO, Thi-Bich-Hanh et al.Lecture notes in computer science. 2004, pp 87-106, issn 0302-9743, isbn 3-540-21834-3, 20 p.Conference Paper

The impact of AND/OR search spaces on constraint satisfaction and countingDECHTER, Rina; MATEESCU, Robert.Lecture notes in computer science. 2004, pp 731-736, issn 0302-9743, isbn 3-540-23241-9, 6 p.Conference Paper

Interchangeability in soft CSPsBISTARELLI, Stefano; FALTINGS, Boi; NEAGU, Nicoleta et al.Lecture notes in computer science. 2003, pp 31-46, issn 0302-9743, isbn 3-540-00986-8, 16 p.Conference Paper

Global optimization and constraint satisfaction (Valbonne-Sophia Antipolis, 2-4 October 2002, revised selected papers)Bliek, Christian; Jermann, Christophe; Neumaier, Arnold et al.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-20463-6, XII, 238 p, isbn 3-540-20463-6Conference Proceedings

(IN)Effectiveness of look-ahead techniques in a modern SAT solverGIUNCHIGLIA, Enrico; MARATEA, Marco; TACCHELLA, Armando et al.Lecture notes in computer science. 2003, pp 842-846, issn 0302-9743, isbn 3-540-20202-1, 5 p.Conference Paper

On the dynamic detection of interchangeability in finite constraint satisfaction problemsBECKWITH, Amy M; CHOUEIRY, Berthe Y.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42863-1, p. 760Conference Paper

Translations for comparing soft frameworksGENNARI, Rosella.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42863-1, p. 764Conference Paper

A tractable subclass of the block algebra : Constraint propagation and preconvex relationsBALBIANI, P; CONDOTTA, J.-F; FARINAS DEL CERRO, L et al.Lecture notes in computer science. 1999, pp 75-89, issn 0302-9743, isbn 3-540-66548-XConference Paper

MODELISATION DECLARATIVE DE SCENES : ETUDE ETE REALISATION DE SOLVEURS DE CONTRAINTES = SCENE DECLARATIVE MODELLING : STUDY AND IMPLEMENTATION A CONSTRAINTS SOLVERSKwaiter, Ghassan; Caubet, René.1998, 235 p.Thesis

Technical Perspective Constraint Satisfaction Problems and Computational ComplexityJERRUM, Mark.Communications of the ACM. 2010, Vol 53, Num 9, issn 0001-0782, p. 98Article

Extremal CSPsPRCOVIC, Nicolas.Lecture notes in computer science. 2005, pp 807-811, issn 0302-9743, isbn 3-540-29238-1, 1Vol, 5 p.Conference Paper

Property grammars : A fully constraint-based theoryBLACHE, Philippe.Lecture notes in computer science. 2005, pp 1-16, issn 0302-9743, isbn 3-540-26165-6, 16 p.Conference Paper

Consistency and random constraint satisfaction models with a high constraint tightnessYONG GAO; CULBERSON, Joseph.Lecture notes in computer science. 2004, pp 17-31, issn 0302-9743, isbn 3-540-23241-9, 15 p.Conference Paper

The tractability of global constraintsBESSIERE, Christian; HEBRARD, Emmanuel; HNICH, Brahim et al.Lecture notes in computer science. 2004, pp 716-720, issn 0302-9743, isbn 3-540-23241-9, 5 p.Conference Paper

Special issue on soft constraintsROSSI, Francesca; CODOGNET, Philippe.Constraints (Dordrecht). 2003, Vol 8, Num 1, issn 1383-7133, 97 p.Serial Issue

Recent advances in constraints (Cork, 19-21 June 2002, selected papers)O'Sullivan, Barry.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-00986-8, X, 199 p, isbn 3-540-00986-8Conference Proceedings

Linear invariant generation using non-linear constraint solvingCOLON, Michael A; SANKARANARAYANAN, Sriram; SIPMA, Henny B et al.Lecture notes in computer science. 2003, pp 420-432, issn 0302-9743, isbn 3-540-40524-0, 13 p.Conference Paper

Is constraint satisfaction over two variables always easy?ENGEBRETSEN, Lars; GURUSWAMI, Venkatesan.Lecture notes in computer science. 2002, pp 224-238, issn 0302-9743, isbn 3-540-44147-6, 15 p.Conference Paper

  • Page / 95